Combinatorial Formulae for Grothendieck-demazure and Grothendieck Polynomials

نویسنده

  • COLLEEN ROSS
چکیده

∂if = f− sif xi − xi+1 where si acts on f by transposing xi and xi+1 and let π̃i = ∂i(xi(1− xi+1)f) Then the Grothendieck-Demazure polynomial κα, which is attributed to A. Lascoux and M. P. Schützenberger, is defined as κα = x α1 1 x α2 2 x α3 3 ... if α1 ≥ α2 ≥ α3 ≥ ..., i.e. α is non-increasing, and κα = π̃iκαsi if αi < αi+1, where si acts on α by transposing the indices. Example 2.1. Let α = (0, 2, 1). Then

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on Schubert, Grothendieck and Key Polynomials

We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco–Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial properties of the reduced rectangular plactic algebra and associated Cauchy kernels.

متن کامل

Multiplicative rule in the Grothendieck cohomology of a flag variety

In the Grothendieck cohomology of a flag variety G/H there are two canonical additive bases, namely, the Demazure basis [D] and the Grothendieck basis [KK]. We present explicit formulae that reduce the multiplication of these basis elements to the Cartan numbers of G.

متن کامل

Factorial Grothendieck Polynomials

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a generalisation of a Littlewood-Richardson rule for Grothendieck polynomials.

متن کامل

Combinatorial Rules for Three Bases of Polynomials

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1, x2, ....]. First, we prove a ”splitting” rule for the basis of Key polynomials [Demazure ’74], thereby establishing a new positivity theorem about them. Second, we introduce an extension of [Kohnert ’90]’s ”moves” to conjecture the first combinatorial rule for a certain deformation [Lascoux ’01] of ...

متن کامل

Polynomials Defined by Tableaux and Linear Recurrences

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure atoms. The same technique can be applied to Hall–Littlewood polynomials and dual Grothendieck polynomials. The motivation behind this is that such recurrences...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011